Schutte has also contributed ClipPoly, an extended C++ polygon clipping library with set operators. Classical clipping algorithms will tell you whether a point "x" is withing a given polygon "A". ClipPoly handles the more general case of two polygons "A" and "B" where you want to know the areas of intersection of "A" and "B", "A" minus B", and "B" minus "A". Although the Weiler-Atherton algorithm already solves this case, Schutte presents a simpler but just as effective algorithm. The ClipPoly algorithm requires only that all polygons are non-self-intersecting (i.e. there are no "holes").
Index of /vol_400/451_01/
Schutte has also contributed ClipPoly, an extended C++ polygon clipping library with set operators. Classical clipping algorithms will tell you whether a point "x" is withing a given polygon "A". ClipPoly handles the more general case of two polygons "A" and "B" where you want to know the areas of intersection of "A" and "B", "A" minus B", and "B" minus "A". Although the Weiler-Atherton algorithm already solves this case, Schutte presents a simpler but just as effective algorithm. The ClipPoly algorithm requires only that all polygons are non-self-intersecting (i.e. there are no "holes").
- clippoly.tz
- 47114 08-12-96 08-12-96
- clippoly/